منابع مشابه
Nominal Abstraction
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via generic judgments. However, logics encompa...
متن کاملGeneralised Name Abstraction for Nominal Sets
The Gabbay-Pitts nominal sets model provides a framework for reasoning with names in abstract syntax. It has appealing semantics for name binding, via a functor mapping each nominal set to the ‘atomabstractions’ of its elements. We wish to generalise this construction for applications where sets, lists, or other patterns of names are bound simultaneously. The atom-abstraction functor has left a...
متن کاملAnimal, dog, or dalmatian? Level of abstraction in nominal referring expressions
Nominal reference is very flexible—the same object may be called a dalmatian, a dog, or an animal when all are literally true. What accounts for the choices that speakers make in how they refer to objects? The addition of modifiers (e.g. big dog) has been extensively explored in the literature, but fewer studies have explored the choice of noun, including its level of abstraction. We collected ...
متن کاملComputing Science Group FULL ABSTRACTION FOR NOMINAL EXCEPTIONS AND GENERAL REFERENCES
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names and nominal general references. Here we make a step further by developing a fully abstract semantics for a language with nominal...
متن کاملClosed nominal rewriting and efficiently computable nominal
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete and efficient procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.09.004